| Definitions | (e < e'), x:A  B(x),  x:A. B(x), s = t, t  T, strong-subtype(A;B), P   Q, ES, AbsInterface(A), E(X),  A, f**(e), X(e), sender(e), e  loc e' , e c e', (e <loc e'), x:A  B(x),  b, left + right, P  Q, {x:A| B(x)} , Void, False, Top, f(a), prior-f-fixedpoints(e), E,  , type List, a:A fp B(a), <a, b>, prior(X), e  X, Type, EqDecider(T), Unit, IdLnk, Id, EOrderAxioms(E; pred?; info), EState(T), Knd,   x. t(x), x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r s, constant_function(f;A;B), P & Q, loc(e), kind(e), let x,y = A in B(x;y), [], A List , [car / cdr], case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi ,  , as @ bs, ff, b, tt, P  Q, p =b q, i <z j, i z j, (i = j), x =a y, null(as), a < b, x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, a = b, deq-member(eq;x;L), e = e', p q, p  q, p q,  , a < b, {T}, n+m, A B, Outcome, #$n, S  T, n - m, |g|, (x l),  x:A. B(x), SWellFounded(R(x;y)), pred!(e;e'),  x:A.B(x), suptype(S; T), first(e), pred(e), x.A(x), i  j , -n |